Delaunay Properties of Digital Straight Segments
نویسندگان
چکیده
We present new results concerning the Delaunay triangulation of the set of points of pieces of digital straight lines. More precisely, we show how the triangulation topology follows the arithmetic decomposition of the line slope as well as its combinatorial decomposition (splitting formula). A byproduct is a linear time algorithm for computing the Delaunay triangulation and the Voronoi diagram of such sets.
منابع مشابه
Euclidean farthest-point Voronoi diagram of a digital edge
A digital edge is a digitization of a straight segment joining two points of integer coordinates. Such a digital set may be analytically defined by the rational slope of the straight segment. We show in this paper that the convex hull, the Euclidean farthest-point Voronoi diagram as well as the dual farthest-point Delaunay triangulation of a digital edge can be fully described by the continued ...
متن کاملOn triangulation axes of polygons
We propose the triangulation axis as an alternative skeletal structure for a simple polygon P . This axis is a straight-line tree that can be interpreted as an anisotropic medial axis of P , where inscribed disks are line segments or triangles. The underlying triangulation that specifies the anisotropy can be varied, to adapt the axis so as to reflect predominant geometrical and topological fea...
متن کاملIntersecting straight line segments with disks: complexity and approximation
Computational complexity and approximability are studied for a problem of intersecting a set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms a straight line drawing G = (V,E) of a planar graph without edge crossings. Similar problems arise e.g. in network security applications (Agarwal et al., 2013). We claim strong NP-ha...
متن کاملStabbing Line Segments with Disks: Complexity and Approximation Algorithms
Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line drawing of planar graph. This problem along with its relatives [3] arise in physical network security analysis for telecommunication, wireless and road networks represented by geometric graphs ...
متن کاملFunctional Delaunay Reenement
Given a complex of vertices, constraining segments (and planar straight-line constraining facets in 3D) and an-Lipschitz control spacing function f() over the domain, an algorithm presented herein can generate a conforming mesh of Delaunay triangles (tetrahedra in 3D) whose circumradius-to-shortest-edge ratios are no greater than p 2 (2 in 3D). The triangle (tetra-hedron) size is within a const...
متن کامل